DP-3-coloring of planar graphs without certain cycles
نویسندگان
چکیده
DP-coloring is a generalization of list-coloring, which was introduced by Dvořák and Postle. Zhang showed that every planar graph with neither adjacent triangles nor 5-, 6-, 9-cycles 3-choosable. Liu et al. without 4-, 6- DP-3-colorable. In this paper, we show DP-3-colorable, generalizes these results. Yu gave three Bordeaux-type results showing that: (i) the distance at least no 5-cycles DP-3-colorable; (ii) two 6-cycles (iii) 7-cycles We also give in last section: 8-cycles less than
منابع مشابه
Equitable ∆-Coloring of Planar Graphs without 4-cycles
In this paper, we prove that if G is a planar graph with maximum degree ∆ ≥ 7 and without 4-cycles, then G is equitably m-colorable for any m≥ ∆.
متن کاملTotal coloring of planar graphs without some chordal 6-cycles
A k-total-coloring of a graph G is a coloring of vertex set and edge set using k colors such that no two adjacent or incident elements receive the same color. In this paper, we prove that if G is a planar graph with maximum ∆ ≥ 8 and every 6-cycle of G contains at most one chord or any chordal 6-cycles are not adjacent, then G has a (∆ + 1)-total-coloring.
متن کاملIncidence coloring of planar graphs without adjacent small cycles
An incidence of an undirected graph G is a pair (v, e) where v is a vertex of G and e an edge of G incident with v. Two incidences (v, e) and (w, f) are adjacent if one of the following holds: (i) v = w, (ii) e = f or (iii) vw = e or f . An incidence coloring of G assigns a color to each incidence of G in such a way that adjacent incidences get distinct colors. In 2012, Yang [15] proved that ev...
متن کاملA note on 3-choosability of planar graphs without certain cycles
Steinberg asked whether every planar graph without 4 and 5 cycles is 3-colorable. Borodin, and independently Sanders and Zhao, showed that every planar graph without any cycle of length between 4 and 9 is 3-colorable. We improve this result by showing that every planar graph without any cycle of length 4, 5, 6, or 9 is 3-choosable. © 2005 Elsevier B.V. All rights reserved.
متن کاملList-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles
Let G be a planar graph without 4-cycles and 5-cycles and with maximum degree ∆ ≥ 32. We prove that χ`(G ) ≤ ∆ + 3. For arbitrarily large maximum degree ∆, there exist planar graphs G∆ of girth 6 with χ(G 2 ∆) = ∆ + 2. Thus, our bound is within 1 of being optimal. Further, our bound comes from coloring greedily in a good order, so the bound immediately extends to online list-coloring. In additi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.02.034